1746A - Maxmina - CodeForces Solution

constructive algorithms greedy

Please click on ads to support us..

Python Code: 

num=int(input())
for i in range(num):
   a,b=map(int,input().split())
   arr=map(int,input().split())
   stack=[]
   counter=0
   for j in arr:
       if counter==0:
           stack.append(j)
           counter=counter+1
       else:
           if stack[0]<j:
               stack[0]=j
   if stack[0]==1:
       print("YES")
   else:
       print("NO")

C++ Code: 

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin >> t;
    while (t--)
    {

        int n, k;
        cin >> n >> k;
        int arr[n];
        for (int i = 0; i < n; i++)
            cin >> arr[i];
        bool flag = false;
        for (int i = 0; i < n; i++)
        {
            if (arr[i] == 1)
                flag = true;
        }
        if (flag)
            cout << "YES" << endl;
        else
            cout << "NO" << endl;
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

Ali and Helping innocent people
Book of Potion making
Duration
Birthday Party
e-maze-in
Bricks Game
Char Sum
Two Strings
Anagrams
Prime Number
Lexical Sorting Reloaded
1514A - Perfectly Imperfect Array
580A- Kefa and First Steps
1472B- Fair Division
996A - Hit the Lottery
MSNSADM1 Football
MATCHES Playing with Matches
HRDSEQ Hard Sequence
DRCHEF Doctor Chef
559. Maximum Depth of N-ary Tree
821. Shortest Distance to a Character
1441. Build an Array With Stack Operations
1356. Sort Integers by The Number of 1 Bits
922. Sort Array By Parity II
344. Reverse String
1047. Remove All Adjacent Duplicates In String
977. Squares of a Sorted Array
852. Peak Index in a Mountain Array
461. Hamming Distance
1748. Sum of Unique Elements